Finding maximum-weight consistent digitally convex regions
نویسندگان
چکیده
We describe an algorithm to find maximum-weight digitally convex regions in gray-scale images. After Christ et al. [CPS10] gave a system for consistent digital line systems, the question how to transfer the concept of convexity to digital regions naturally appeared. The regions computed using this definition are weight-maximal, the computational complexity of our algorithm amounts to O(n5 · log n). With additional input data constraining the possible solution, this bound can be improved to O(n3 · log n). We further describe a hybrid approximation algorithm that first generates suitable constraints by executing the O(n5 · log n)-algorithm on a downscaled version of the input image and then uses these constraints to achieve the O(n3 · log n) bound.
منابع مشابه
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes
Recent work of Brlek et al. gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze their limit properties and build a uniform sampler. Experimentally, our sampler shows a limit shape for large digitally convex polyominoes. Introduction In discrete ...
متن کاملMaximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
We consider an optimization version of the image segmentation problem, in which we are given a grid graph with weights on the grid cells. We are interested in finding the maximum weight subgraph such that the subgraph can be decomposed into two ”star-shaped” images. We show that this problem can be reduced to the problem of finding a maximum-weight closed set in an appropriately defined directe...
متن کاملSquare-Free 2-Matchings in Bipartite Graphs and Jump Systems
For an undirected graph and a fixed integer k, a 2-matching is said to be Ck-free if it has no cycle of length k or less. In particular, a C4-free 2-matching in a bipartite graph is called a square-free 2-matching. The problem of finding a maximum Ck-free 2-matching in a bipartite graph is NP-hard when k ≥ 6, and polynomially solvable when k = 4. Also, the problem of finding a maximum-weight Ck...
متن کاملGenerating and Enumerating Digitally Convex Sets of Trees
Suppose V is a finite set and C a collection of subsets of V that contains ∅ and V and is closed under taking intersections. Then C is called a convexity and the ordered pair (V, C) is called an aligned space and the elements of C are referred to as convex sets. For a set S ⊆ V , the convex hull of S relative to C, denoted by CHC(S), is the smallest convex set containing S. A set S of vertices ...
متن کاملWhite Space Regions
We study a classical problem in communication and wireless networks called Finding White Space Regions. In this problem, we are given a set of antennas (points) some of which are noisy (black) and the rest are working fine (white). The goal is to find a set of convex hulls with maximum total area that cover all white points and exclude all black points. In other words, these convex hulls make i...
متن کامل